Revision 01 of a Public-key Cryptosystem with Worst-case/average-case Equivalence
نویسندگان
چکیده
We present a probabilistic public key cryptosystem which is secure unless the worst case of the following lattice problem can be solved in polynomial time: \Find the shortest nonzero vector in an n dimensional lattice L where the shortest vector v is unique in the sense that any other vector whose length is at most n c kvk is parallel to v."
منابع مشابه
The First and Fourth Public-Key Cryptosystems with Worst-Case/Average-Case Equivalence
We describe a public-key cryptosystem with worst-case/average case equivalence. The cryptosystem has an amortized plaintext to ciphertext expansion of O(n), relies on the hardness of the Õ(n)-unique shortest vector problem for lattices, and requires a public key of size at most O(n) bits. The new cryptosystem generalizes a conceptually simple modification of the “Ajtai-Dwork” cryptosystem. We p...
متن کاملA Lattice-Based Public-Key Cryptosystem
Ajtai recently found a random class of lattices of integer points for which he could prove the following worst-case/average-case equivalence result: If there is a probabilistic polynomial time algorithm which nds a short vector in a random lattice from the class, then there is also a probabilistic polynomial time algorithm which solves several problems related to the shortest lattice vector pro...
متن کاملnt - p h / 04 03 06 9 v 6 1 2 M ar 2 01 1 Computational Indistinguishability between Quantum States and Its Cryptographic Application ∗
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secure” against any polynomialtime quantum adversary. Our problem, QSCDff , is to distinguish between two types of random coset states with a hidden permutation over the symmetric group of finite degree. This naturally genera...
متن کاملCryptanalysis of the Ajtai-Dwork Cryptosystem
Recently, Ajtai discovered a fascinating connection between the worst-case complexity and the average-case complexity of some wellknown lattice problems. Later, Ajtai and Dwork proposed a cryptosystem inspired by Ajtai’s work, provably secure if a particular lattice problem is difficult in the worst-case. We present a heuristic attack (to recover the private key) against this celebrated cryptos...
متن کاملCryptanalysis of the Ajtai - Dwork
Recently, Ajtai discovered a fascinating connection between the worst-case complexity and the average-case complexity of some well-known lattice problems. Later, Ajtai and Dwork proposed a cryptosystem inspired by Ajtai's work, provably secure if a particular lattice problem is diicult in the worst-case. We present a heuristic attack (to recover the private key) against this celebrated cryptosy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996